Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
نویسنده
چکیده
We present new probabilistic generalizations of Pearl’s entailment in System [50, 32] and Lehmann’s lexicographic entailment [39], called and -entailment, which are parameterized through a value that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of and , the notions of and -entailment coincide with the probabilistic notions of and -entailment recently introduced by the author in [45] and [46], respectively. We show that the notions of and -entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System ! and the property of Rational Monotonicity. Moreover, -entailment is weaker than -entailment, and both and -entailment are proper generalizations of their classical counterparts. 1Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198 Rome, Italy; e-mail: [email protected]. Alternate address: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria; e-mail: [email protected]. Acknowledgements: This research has been supported by a Marie Curie Individual Fellowship of the European Community programme “Human Potential” under contract number HPMF-CT-2001-001286 (Disclaimer: The author is solely responsible for information communicated and the European Commission is not responsible for any views or results expressed) and by the Austrian Science Fund under project N Z29-INF. Copyright c " 2003 by the authors INFSYS RR 1843-03-02 I
منابع مشابه
Probabilistic Lexicographic Entailment under Variable-Strength Inheritance with Overriding
In previous work, I have presented approaches to nonmonotonic probabilistic reasoning, which is a probabilistic generalization of default reasoning from conditional knowledge bases. In this paper, I continue this exciting line of research. I present a new probabilistic generalization of Lehmann’s lexicographic entailment, called -entailment, which is parameterized through a value that describes...
متن کاملNonmonotonic Probabilistic Logics under Variable-Strength Inheritance with Overriding: Algorithms and Implementation in NMPROBLOG
In previous work, I have introduced nonmonotonic probabilistic logics under variablestrength inheritance with overriding. They are formalisms for probabilistic reasoning from sets of strict logical, default logical, and default probabilistic sentences, which are parameterized through a value λ∈ [0, 1] that describes the strength of the inheritance of default probabilistic knowledge. In this pap...
متن کاملProbabilistic Logic Programming under Inheritance with Overriding
We present probabilistic logic programming un der inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment by adding inheritance with overriding. This is done by using recent approaches to probabilistic de fault reasoning with conditional constraints. We analy...
متن کاملProbabilistic Logic Programming under Inheritance with Overriding Probabilistic Logic Programming under Inheritance with Overriding
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment by adding inheritance with overriding. This is done by using recent approaches to probabilistic default reasoning with conditional constraints. We analyze t...
متن کاملAbteilung Wissensbasierte Systeme Probabilistic Logic Programming under Inheritance with Overriding
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment by adding inheritance with overriding. This is done by using recent approaches to probabilistic default reasoning with conditional constraints. We analyze t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 146 شماره
صفحات -
تاریخ انتشار 2005